/*O(n^2)
#include <iostream>
#include <algorithm>
#define MAX_IN 100000+1
using namespace std;

int main()
{
    int inp[MAX_IN];
    int in, cnt = 0;
    while (cin >> in)
    {
        ++cnt;
        inp[cnt] = in;
    }
    int out[cnt+1];
    fill(out, out+cnt+1, 1);
    for (int i=2; i<=cnt; ++i)
        for (int j=i-1; j>=1; --j)
            if (inp[j] >= inp[i]) out[i] = max(out[i], out[j]+1);
    cout << *max_element(out, out+1+cnt) << endl;
    cout << 1;
    return 0;
}
*/

//O(nlogn)
#include <iostream>
#include <algorithm>
#define MAX_IN 100000+1
using namespace std;

int main()
{
    int inp[MAX_IN];
    int in, cnt = 0;
    while (cin >> in)
    {
        ++cnt;
        inp[cnt] = in;
    }
    int out[cnt+1];
    fill(out, out+cnt+1, 1);

    return 0;
}
